Algorithm Invention and Verification by Lazy Thinking
نویسنده
چکیده
Acknowledgment: Sponsored by FWF (Österreichischer Fonds zur Förderung der Wissenschaftlichen Forschung; Austrian Science Foundation, Project SFB 1302, in the frame of the SFB "Scientific Computing" at the Johannes Kepler University, Linz, Austria. My PhD student Adrian Craciun implemented the case study in the frame of the Theorema system starting from my earlier versions of the induction prover, the conjecture generation algorithm, and the cascade.
منابع مشابه
ALGORITHM INVENTION AND VERIFICATION BY LAZY THINKING Presented at the 5 International Workshop on Symbolic and Numeric Algorithms for Scientific Computation
In this paper, we study algorithm invention and verification as a specific variant of systematic theory exploration and propose the ”lazy thinking paradigm” for inventing and verifying algorithms automatically; i.e., for a given predicate logic specification of the problem in terms of a set of operations (functions and predicates), the method produces an algorithm that solves the problem togeth...
متن کاملAlgorithm Synthesis by Lazy Thinking: Examples and Implementation in Theorema
Recently, we proposed a systematic method for top-down synthesis and verification of lemmata and algorithms called ”lazy thinking method” as a part of systematic mathematical theory exploration (mathematical knowledge management). The lazy thinking method is characterized: • by using a library of theorem and algorithm schemes • and by using the information contained in failing attempts to prove...
متن کاملAlgorithm Synthesis by Lazy Thinking: Using Problem Schemes
Recently, as part of a general formal (i.e. logic based) methodology for mathematical knowledge management we also introduced a method for the automated synthesis of correct algorithms, which we called the lazy thinking method. For a given concrete problem specification (in predicate logic), the method tries out various algorithm schemes and derives specifications for the subalgorithms in the a...
متن کاملTowards the Automated Synthesis of a Gröbner Bases Algorithm
We discuss the question of whether the central result of algorithmic Gröbner bases theory, namely the notion of S–polynomials together with the algorithm for constructing Gröbner bases using S–polynomials, can be obtained by “artificial intelligence”, i.e. a systematic (algorithmic) algorithm synthesis method. We present the “lazy thinking” method for theorem and algorithm invention and apply i...
متن کاملUnbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches - (Competition Contribution)
We describe a new CSeq module for the verification of multi-threaded C programs with dynamic thread creation. This module implements a variation of the lazy sequentialization algorithm implemented in Lazy-CSeq. The main novelty is that we now support an unbounded number of context switches and allow unbounded loops, while the number of allowed threads still remains bounded. This is achieved by ...
متن کامل